منابع مشابه
A Deterministic Initialization for Optimizing Carrier-Cooperative Transmit Strategies
Even though capacity can be achieved in parallel multiple-input multiple-output (MIMO) broadcast channels by coding separately on each carrier, joint coding across carriers (socalled carrier-cooperative transmission) can lead to performance gains in MIMO broadcast channels with a restriction to linear transceivers. In principle, carrier-cooperative transmission can be optimized in an equivalent...
متن کاملdesigning a fast locking pll
a phase-locked loop (pll) based frequency synthesizer is an important circuit that is used in many applications, especially in communication systems such as ethernet receivers, disk drive read/write channels, digital mobile receivers, high-speed memory interfaces, system clock recovery and wireless communication system. other than requiring good signal purity such as low phase noise and low spu...
Deterministic Initialization of the K-Means Algorithm Using Hierarchical Clustering
K-means is undoubtedly the most widely used partitional clustering algorithm. Unfortunately, due to its gradient descent nature, this algorithm is highly sensitive to the initial placement of the cluster centers. Numerous initialization methods have been proposed to address this problem. Many of these methods, however, have superlinear complexity in the number of data points, making them imprac...
متن کاملFast Deterministic Backtrack Search
The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. This note describes a fast, deterministic backtrack search algorithm for a p-processor COMMON CRCW-PRAM that visits any n-node tree of height h in time O ? (n=p + h)(log log lo...
متن کاملFast Deterministic Selection
The Median of Medians (also known as BFPRT) algorithm, although a landmark theoretical achievement, is seldom used in practice because it and its variants are slower than simple approaches based on sampling. The main contribution of this paper is a fast linear-time deterministic selection algorithm QUICKSELECTADAPTIVE based on a refined definition of MEDIANOFMEDIANS. The algorithm’s performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2017
ISSN: 2249-0868
DOI: 10.5120/ijais2017451683